Shripad Thite Thesis: Spacetime Meshing for Discontinuous Galerkin Methods
نویسندگان
چکیده
s and Manuscripts [18] Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements. Shripad Thite. Manuscript, 2006; arXiv:cs.CC/0606038 [19] On Covering a Graph Optimally with Induced Subgraphs. Shripad Thite. Manuscript, 2006; arXiv: cs.DM/0604013 [20] Adaptive Spacetime Meshing in 2D×Time for Nonlinear and Anisotropic Media. Shripad Thite, Jayandran Palaniappan, Jeff Erickson, Robert Haber. Minisymposium on Mesh and Geometry Generation at the 8th US National Congress on Computational Mechanics, January 2005. [21] Meshing in 2D×Time for Front-Tracking DG Methods. Shripad Thite, Jeff Erickson, Shuo-Heng Chung, Reza Abedi, Jayandran Palaniappan, Robert Haber. Minisymposium on Mesh and Geometry Generation at the 8th US National Congress on Computational Mechanics, January 2005. [22] Efficient Spacetime Meshing with Nonlocal Cone Constraints. Jeff Erickson, Robert Haber, Jayandran Palaniappan, John Sullivan, Shripad Thite. 4th Symposium on Trends in Unstructured Mesh Generation at the 7th US National Congress on Computational Mechanics, July 27–31, 2003. [23] Spacetime Meshing with Adaptive Coarsening and Refinement. Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Robert Haber, John Sullivan, Shripad Thite. 4th Symposium on Trends in Unstructured Mesh Generation at the 7th US National Congress on Computational Mechanics, July 27–31, 2003.
منابع مشابه
Spacetime Meshing with Adaptive Coarsening and Refinement
We propose a new algorithm for constructing finite-element meshes suitable for spacetime discontinuous Galerkin solutions of linear hyperbolic PDEs. Our new method is a generalization of the ‘Tent Pitcher’ algorithms of Üngör and Sheffer [3] and Erickson et al. [2]. Given a simplicially-meshed domain Ω in IR and a target time value T , our method constructs a mesh of the spacetime domain Ω× [0,...
متن کاملSpacetime Meshing for Discontinuous Galerkin Methods
Spacetime discontinuous Galerkin (DG) methods are used to solve hyperbolic partial differential equations (PDEs) describing wavelike mechanical phenomena. Given a simplicially meshed space domain M ⊂ R, the TentPitcher algorithm developed by [65] and [25] is an advancing front algorithm to incrementally construct a simplicial mesh of the spacetime domain M × [0,∞) ⊂ R that supports an efficient...
متن کاملXXI ICTAM, 15–21 August 2004, Warsaw, Poland ADAPTIVE DISCONTINUOUS GALERKIN METHOD FOR ELASTODYNAMICS ON UNSTRUCTURED SPACETIME GRIDS
We present an adaptive spacetime discontinuous Galerkin (SDG) method for linearized elastodynamics. The SDG method uses a simple Bubnov-Galerkin projection that delivers stable and oscillation–free solutions, with O (N) complexity and exact momentum balance on every spacetime element. An extended version of the Tent Pitcher algorithm generates unstructured spacetime grids that support simultane...
متن کاملAdaptive spacetime meshing for discontinuous Galerkin methods
Spacetime-discontinuous Galerkin (SDG) finite element methods are used to solve hyperbolic spacetime partial differential equations (PDEs) to accurately model wave propagation phenomena arising in important applications in science and engineering. Tent Pitcher is a specialized algorithm, invented by Üngör and Sheffer [2000], and extended by Erickson et al. [2005], to construct an unstructured s...
متن کاملEfficient Spacetime Meshing with Nonlocal Cone Constraints
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of the phenomena, called the wavespeed, at any point in the spacetime domain is computed as part of the solution. We give an advancing front algorithm to construct a simplicial mesh of the spacetime domain suitable for DG s...
متن کامل